Bubble Sort - HackerEarth Solution


Math Array

Python Code:

r = int(input())
t = list(map(int , input().split()))


count = 1
a = 0
j = 0
while count!=0:
    count = 0

    a+=1
    for i in range(len(t)-1 -j):
        if t[i] > t[i+1]:
            t[i], t[i+1] = t[i+1], t[i]
            count+=1

    j+=1

print(a)


Comments

Submit
0 Comments
More Questions

698A - Vacations
1216B - Shooting
368B - Sereja and Suffixes
1665C - Tree Infection
1665D - GCD Guess
29A - Spit Problem
1097B - Petr and a Combination Lock
92A - Chips
1665B - Array Cloning Technique
1665A - GCD vs LCM
118D - Caesar's Legions
1598A - Computer Game
1605A - AM Deviation
1461A - String Generation
1585B - Array Eversion
1661C - Water the Trees
1459A - Red-Blue Shuffle
1661B - Getting Zero
1661A - Array Balancing
1649B - Game of Ball Passing
572A - Arrays
1455A - Strange Functions
1566B - MIN-MEX Cut
678C - Joty and Chocolate
1352E - Special Elements
1520E - Arranging The Sheep
1157E - Minimum Array
1661D - Progressions Covering
262A - Roma and Lucky Numbers
1634B - Fortune Telling